On efficient k-optimal-location-selection query processing in metric spaces
نویسندگان
چکیده
منابع مشابه
On efficient k-optimal-location-selection query processing in metric spaces
This paper studies the problem of k-optimal-location-selection (kOLS) retrieval in metric spaces. Given a set DA of customers, a set DB of locations, a constrained region R, and a critical distance dc , a metric kOLS (MkOLS) query retrieves k locations in DB that are outside R but have the maximal optimality scores. Here, the optimality score of a location l 2 DB located outside R is defined as...
متن کاملCollective-k Optimal Location Selection
We study a novel location optimization problem, the Collective-k Optimal Location Selection (CkOLS) problem. This problem finds k regions such that setting up k service sites, one in each region, collectively attracts the maximum number of customers by proximity. The problem generalizes the traditional influence maximizing location selection problem from searching for one optimal region to k re...
متن کاملResource Description and Selection for Range Query Processing in General Metric Spaces
Similarity search in general metric spaces is a key aspect in many application fields. Metric space indexing provides a flexible indexing paradigm and is solely based on the use of a distance metric. No assumption is made about the representation of the database objects. Nowadays, ever-increasing data volumes require large-scale distributed retrieval architectures. Here, local and global indexi...
متن کاملStrong $I^K$-Convergence in Probabilistic Metric Spaces
In this paper we introduce strong $I^K$-convergence of functions which is common generalization of strong $I^*$-convergence of functions in probabilistic metric spaces. We also define and study strong $I^{K}$-limit points of functions in same space.
متن کاملDistributed k-NN Query Processing for Location Services
The architecture named the GALIS is a cluster-based distributed computing system architecture which has been devised to efficiently handle a large volume of LBS application data. In this paper, we propose a distributed kNN query processing scheme for moving objects on multiple computing nodes, each of which keeps records relevant to a different geographical zone. We also propose a hybrid k-NN s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.11.038